Asynchronous cellular automata for pomsets

Asynchronous Cellular Automata and Logic for Pomsets without Auto-concurrency

This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Our main result generalizes Buchi's theorem for nite words t...

Survey of this article: Asynchronous Cellular Automata for pomsets. Mamadou Kanté. Lesson: IR.

On the Expressiveness of Asynchronous Cellular Automata

We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential fragment of monadic second-order logic. In doing so, we provide a framework that unifies many approaches to modeling distributed systems such as the models of asynchronous trace automata and communicating ...

Regular Pomset Languages: Closure Properties and Msol Deenability

We compare the general notion of regularity deened in FM02] for languages of pomsets (with autoconcurrency) with the deenability in MSOL of such languages. We show that for the class of bounded languages, deenability implies regularity. It shows that for bounded languages of pomsets without autoconcurrency, the recognisability by Asynchronous Cellular Automata as deened in DGK00] implies regula...

Automata for Partially Ordered and Partially Reliable Connections

We present a formal model for the speciication of a transport protocol with partially ordered and partially reliable data delivery. An abstract syntax is deened to specify order and reliability constraints in data ows, and is also used to specify the particular automata which recognise exactly the sets of deliverable streams. This new class of automata extends the Asynchronous Cellular Automata...